Approximating roots by quadratic iteration
نویسندگان
چکیده
We apply a coctel of elementary methods to the problem finding roots an arbitrary polynomial. Specifically, we combine properties iteration z → z2 + c with rudimentary Galois theory in order justify algorithm find complex
منابع مشابه
New iteration process for approximating fixed points in Banach spaces
The object of this paper is to present a new iteration process. We will show that our process is faster than the known recent iterative schemes. We discuss stability results of our iteration and prove some results in the context of uniformly convex Banach space for Suzuki generalized nonexpansive mappings. We also present a numerical example for proving the rate of convergence of our res...
متن کاملApproximating the Distributions of Singular Quadratic Expressions and their Ratios
Noncentral indefinite quadratic expressions in possibly non- singular normal vectors are represented in terms of the difference of two positive definite quadratic forms and an independently distributed linear combination of standard normal random variables. This result also ap- plies to quadratic forms in singular normal vectors for which no general representation is currently available. The ...
متن کاملComputing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip bounded by two quadratic polynomials which encloses the graph of the polynomial within the interval of interest. The new interval(s) containing the root(s) is (are) obtained by intersecting this strip with the abscissa axi...
متن کاملApproximating quadratic programming with bound and quadratic constraints
We consider the problem of approximating the global maximum of a quadratic program (QP) subject to bound and (simple) quadratic constraints. Based on several early results, we show that a 4=7-approximate solution can be obtained in polynomial time.
متن کاملApproximating Global Quadratic Optimization with Convex Quadratic Constraints
We consider the problem of approximating the global maximum of a quadratic program (QP) subject to convex non-homogeneous quadratic constraints. We prove an approximation quality bound that is related to a condition number of the convex feasible set; and it is the currently best for approximating certain problems, such as quadratic optimization over the assignment polytope, according to the bes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones
سال: 2023
ISSN: ['0716-0917', '0717-6279']
DOI: https://doi.org/10.22199/issn.0717-6279-5447